Weaknesses in the SL2(IFs2) Hashing Scheme
نویسندگان
چکیده
We show that for various choices of the parameters in the SL2(IF2n) hashing scheme, suggested by Tillich and Zémor, messages can be modified without changing the hash value. Moreover, examples of hash functions “with a trapdoor” within this family are given. Due to these weaknesses one should impose at least certain restrictions on the allowed parameter values when using the SL2(IF2n) hashing scheme for cryptographic purposes.
منابع مشابه
On the Security of the Hashing Scheme Based on SL2
Tillich and Zémor proposed a hashing scheme based on the group of unimodular matrices SL2(Fq) over a finite field Fq of q = 2 elements. Charnes and Pieprzyk studied the security of this scheme. They showed that for n = 131 and for some irreducible polynomial P131(x) this scheme is weak. We show that with sufficiently high probability the polynomials Pn(x) can be chosen in such a way that this t...
متن کاملWeaknesses of Password Authentication Scheme Based on Geometric Hashing
We show that a recently proposed password authentication scheme based on geometric hashing has several security weaknesses, and that the use of this scheme should be avoided in practice.
متن کاملImage authentication using LBP-based perceptual image hashing
Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for percep...
متن کاملNavigating in the Cayley graph of SL2(Fp) and applications to hashing
Cayley hash functions are based on a simple idea of using a pair of (semi)group elements, A and B, to hash the 0 and 1 bit, respectively, and then to hash an arbitrary bit string in the natural way, by using multiplication of elements in the (semi)group. In this paper, we focus on hashing with 2× 2 matrices over Fp. Since there are many known pairs of 2× 2 matrices over Z that generate a free m...
متن کاملCompressed Image Hashing using Minimum Magnitude CSLBP
Image hashing allows compression, enhancement or other signal processing operations on digital images which are usually acceptable manipulations. Whereas, cryptographic hash functions are very sensitive to even single bit changes in image. Image hashing is a sum of important quality features in quantized form. In this paper, we proposed a novel image hashing algorithm for authentication which i...
متن کامل